The cut separator problem

نویسندگان

  • Walid Ben-Ameur
  • Mohamed Didi Biha
چکیده

Given G = (V, E) an undirected graph and two speci ed nonadjacent nodes a and b of V , a cut separator is a subset F = δ(C) ⊆ E such that a, b ∈ V \C and a and b belong to di erent connected components of the graph induced by V \C. Given a nonnegative cost vector c ∈ R|E| + , the optimal cut separator problem is to nd a cut separator of minimum cost. This new problem is closely related to the vertex separator problem. In this paper, we give a polynomial time algorithm for this problem. We also present four equivalent linear formulations, and we show their tightness. Using these results we obtain an explicit short polyhedral description of the dominant of the cut separator polytope.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Multi-terminal Vertex Separator Problem: Polyhedral Analysis and Branch-and- Cut

Let G = (V ∪ T, E) be an undirected graph such that V is a set of vertices, E a set of edges and T a set of terminal vertices. The Multi-terminal vertex separator problem consists in partitioning V into k + 1 subsets {S, V1,..., Vk} minimizing the size of S and such that there is no edge between two subsets Vi and Vj and each subset Vi contains exactly one terminal. Set S is called a separator....

متن کامل

The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms. (Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes)

This thesis deals with the multi-terminal vertex separator problem. Given a graph G = (V ∪T,E) with V ∪T the set of vertices, where T is a set of terminals, and a weight function w : V → Z, associated with nonterminal nodes, the multi-terminal vertex separator problem consists in partitioning V ∪T into k+1 subsets {S, V1, . . . , Vk} such that there is no edge between two different subsets Vi a...

متن کامل

Towards an $O(\sqrt[3]{\log n})$-Approximation Algorithm for {\sc Balanced Separator}

The c-Balanced Separator problem is a graph-partitioning problem in which given a graph G, one aims to find a cut of minimum size such that both the sides of the cut have at least cn vertices. In this paper, we present new directions of progress in the c-Balanced Separator problem. More specifically, we propose a new family of mathematical programs, which depends upon a parameter ǫ > 0, and ext...

متن کامل

Approximation Algorithms for Min UnCut, Min 2CNF Deletion, and Directed Cut Problems

We give O( √ logn)-approximation algorithms for the Min UnCut, Min 2CNF Deletion, Directed Balanced Separator, and Directed Sparsest Cut problems. The previously best known algorithms give anO(logn)-approximation for Min UnCut [9], Directed Balanced Separator [17], Directed Sparsest Cut [17], and an O(logn log logn)approximation for Min 2CNF Deletion [14]. We also show that the integrality gap ...

متن کامل

Probabilistic Spectral Sparsification In Sublinear Time

MIT Abstract. In this paper, we introduce a variant of spectral sparsification, called proba-bilistic (ε, δ)-spectral sparsification. Roughly speaking, it preserves the cut value of any cut (S, S c) with an 1 ± ε multiplicative error and a δ |S| additive error. We show how to produce a probabilistic (ε, δ)-spectral sparsifier with O(n log n/ε 2) edges in time˜O(n/ε 2 δ) time for unweighted undi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009